Notes on non-Markovian Extension of Value Passing CCS!
نویسندگان
چکیده
We define a non-Markovian extension of Value Passing CCS, based on PHdistributions. The approach consists in describing the execution time of each action with a PH-distribution, i.e. by associating a finite CTMC with a terminal, absorbing, state to each action of a process. Such CTMC characterises a random variable, namely the time needed to go from the initial state to the final one. It is well known that such distributions can be used for approximating, ideally, any general distribution and are closed under max. The choice of a CCS-like pattern of interaction is motivated by the fact that we are interested in service-oriented computing models and many process calculi for service-oriented computing are based on such a pattern of interaction (see e.g. [8, 1, 2, 6]).
منابع مشابه
An Extensible Interpreter for Value-Passing CCS
1 2 Abstract We describe an interpreter for a value-passing version of CCS implemented in the lazy functional programming language Haskell. Starting from a base interpreter, we then show how to modify the interpreter for CCS extensions including, additional non-primitive combinators, new primitive operators (an interrupt operator), a time domain with a timeout operator useful in describing real...
متن کاملCCS without 's with Built{in Service Rendezvous
1. Abstract We introduce a pure process calculus and a value{passing process calculus in which the discipline of process interaction is not, as usual, the synchronous execution of actions but the service rendezvous (rendezvous). New is the following combination: (1) The rendezvous is a primitive. I.e. every particular rendezvous requires exactly one explicit synchronization between the processe...
متن کاملBasics of Using vp, a Value-Pasing Front End for the Concurrency Workbench
These notes describe some of the basics of using Glenn Bruns’ vp [1], which is a valuepassing front-end for the Concurrency Workbench [3]. The official documentation is available at http://www.bell-labs.com/user/grb/vp/vp.html, but it is fairly cryptic to the uninitiated. These notes are intended to fill in some of the gaps. 1 Running vp An overview of Glenn Bruns’ value-passing front end for t...
متن کاملProbabilistic Barbed Congruence
This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence result, we provide a sound and complete axiomatisation for the barbed congruence in a finite fragment of probabilistic CCS.
متن کاملMean-field models for non-Markovian epidemics on networks: from edge-based compartmental to pairwise models
This paper presents a novel extension of the edge-based compartmental model for epidemics with arbitrary distributions of transmission and recovery times. Using the message passing approach we also derive a new pairwise-like model for epidemics with Markovian transmission and an arbitrary recovery period. The new pairwise-like model allows one to formally prove that the message passing and edge...
متن کامل